#include<bits/stdc++.h>
#define LL long long
#define F(x,s,t) for(int x=s;x<=t;x++)
using namespace std;
int read(){
	int x=0,f=1;
	char ch=getchar();
	for(;!isdigit(ch);ch=getchar())if(ch=='-')f=-1;
	for(;isdigit(ch);ch=getchar())x=x*10+ch-'0';
	return x*f;
}
const int N = 1e5 + 10;
int n;
int a[N];
bool dead[N], atk[N];
int main(){
	freopen("duel.in", "r", stdin);
	freopen("duel.out", "w", stdout);
	n = read();
	F(i, 1, n)a[i] = read();
	
	sort(a + 1, a + n + 1);
	
	int j = 0, cnt = 0;
	F(i, 1, n){
		j = max(i + 1, j);
		while((a[j] <= a[i] || atk[j]) && j <= n)j ++ ;
		if(j > n)break;
		cnt ++ ;
		atk[j] = 1;
	}
	
	printf("%d\n", n - cnt);
	return 0;
}
/*
10
136 136 136 2417 136 136 2417 136 136 136
*/
